The majorization theorem of connected graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Chain Theorem for 3+-Connected Graphs

4 A 3-connected graph is 3-connected if it has no 3-separation that separates a “large” fan or K3,n 5 from the rest of the graph. It is proved in this paper that, except for K4, every 3 -connected graph has 6 a 3-connected proper minor that is at most two edges away from the original graph. This result is used 7 to characterize Q-minor-free graphs, where Q is obtained from the Cube by contracti...

متن کامل

Turán's theorem and k-connected graphs

The minimum size of a k-connected graph with given order and stability number is investigated. If no connectivity is required, the answer is given by Turán’s Theorem. For connected graphs, the problem has been solved recently independently by Christophe et al., and by Gitler and Valencia. In this paper, we give a short proof of their result and determine the extremal graphs. We settle the case ...

متن کامل

Majorization theorem for convexifiable functions

In this paper we extend the majorization theorem from convex to covexifiable functions, in particular to smooth functions with Lipschitz derivative, twice continuously differentiable functions and analytic functions. AMS subject classifications: 26B25, 52A40, 26D15

متن کامل

The maximal total irregularity of some connected graphs

The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.

متن کامل

the maximal total irregularity of some connected graphs

the total irregularity of a graph g is defined as 〖irr〗_t (g)=1/2 ∑_(u,v∈v(g))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈v(g). in this paper by using the gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2009

ISSN: 0024-3795

DOI: 10.1016/j.laa.2009.03.004